Automated Deduction - CADE-25 by Amy P. Felty & Aart Middeldorp

Author:Amy P. Felty & Aart Middeldorp
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

Theorem 18

If T is a clausal tree in normal form, and are clauses in normal form, is negative and then the call terminates and iff .

The algorithm (Algorithm 2) removes from the input tree T all the clauses redundant w.r.t. the input clause C. It proceeds by going through both objects, performing projections and storing the already considered literals in parameters and . Once an entailment is established in this way, all that remains is to compare the selected clauses using the order to detect redundancies. This last part is done by the algorithm (Algorithm 3).

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.